Reviewing Static Path Planning for Mobile Beacons to Localize Mobile Networks

Localization is an essential issue in mobile networks because many applications require the mobile to know their locations with a high degree of precision. Various localization methods based on mobile anchor nodes have been proposed for assisting the mobile nodes to determine their locations. However, none of these methods attempt to optimize the trajectory of the mobile anchor node. Different static path planning algorithms are SCAN, DOUBLE SCAN, HILBERT, CIRCUL, S-CURVE. In SCAN, the mobile anchor node travels along a single dimension while in DOUBLE SCAN, the collinearity problem is resolved by driving the anchor in both the xand the y-directions. In HILBERT, the mobile anchor node is driven along a curved trajectory such that the sensor nodes can construct non-collinear beacon points and the total path length is reduced, In CIRCLES, the mobile anchor follows a sequence of concentric circular trajectories centered at the center point of the deployment area, while in S-CURVES, the anchor follows an S-shaped curve rather than a simple straight line as in the SCAN method. Accordingly, discussed path planning scheme, ensures that the trajectory of the mobile anchor node minimizes the localization error and guarantees that all of the mobile node can determine their locations.